Extending Vehicle Routing by Collaboration and Sub - contraction : Experiments for the estimation of the efficiency improvement

نویسنده

  • Xin Wang
چکیده

Transportation planning requires both, decisions on the choice of transport resources and decisions on the deployment of the chosen resources. Therefore, transportation orders must be assigned to resources for fulfillment while the operations for the usage of each resource have to be planned. Most freight forwarding companies have to cope with a strongly fluctuating demand on the transportation market which varies considerably over time. Aside from these market-fluctuations they have to manage the daily variations of their volume of orders. Therefore , freight forwarding companies have to ensure that enough resources will be provided. On the other hand, the fixed costs of the own vehicle fleet force to reduce the number of own vehicles since it makes no sense for a forwarder to provide enough transportation capacity capable to cover the peaks of a volatile volume of orders. A rigorous reduction of the own fleet size is mostly profitable because it allows the so called cherry-picking which means to perform only the most suitable requests in a very efficient manner by self-fulfillment. But cherry-picking does not really make sense unless the remaining requests are fulfilled in a cost-efficient way as well. Usually, only a part of the upcoming requests is fulfilled by own transportation resources. The remaining part of requests is either fulfilled by entrusting external freight carriers (subcontracting) or by exchanging requests within a coalition of collaborating forwarders. These two different approaches for " external freight fulfillment " result in specific extensions of the common planning problems for vehicle routing. Besides the possibility to fulfill additional requests which would otherwise exceed the own transportation capacity, the approaches for external freight fulfillment can be used to improve the quality of transportation planning. The efficiency of transportation planning can be increased drastically by extending the usual vehicle routing and scheduling problems by the possibilities of collaborative planning and of subcontracting. Both types of problem extension transform the usual vehicle routing and scheduling problems to more general operational transportation problems. In this contribution, we analyze the motivation, the chances, the realization, and the challenges of the general operational transportation planning problems obtained by the above extensions. We report on experiments for combining several isolated vehicle routing problems of single partners to a

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Combining Vehicle Routing with Forwarding

The efficiency of transportation requests fulfillment can be increased through extending the problem of vehicle routing and scheduling by the possibility of subcontracting a part of the requests to external carriers. This problem extension transforms the usual vehicle routing and scheduling problems to the more general integrated operational transportation problems. In this contribution, we ana...

متن کامل

The Special Application of Vehicle Routing Problem with Uncertainty Travel Times: Locomotive Routing Problem

This paper aims to study the locomotive routing problem (LRP) which is one of the most important problems in railroad scheduling in view of involving expensive assets and high cost of operating locomotives. This problem is assigning a fleet of locomotives to a network of trains to provide sufficient power to pull them from their origins to destinations by satisfying a rich set of operational con...

متن کامل

A differential evolution algorithm to solve new green VRP model by optimizing fuel consumption considering traffic limitations for collection of expired products

The purpose of this research is to present a new mathematical modeling for a vehicle routing problem considering concurrently the criteria such as distance, weight, traffic considerations, time window limitation, and heterogeneous vehicles in the reverse logistics network for collection of expired products. In addition, we aim to present an efficient solution approach according to differential ...

متن کامل

A New Mathematical Model for the Green Vehicle Routing Problem by Considering a Bi-Fuel Mixed Vehicle Fleet

This paper formulates a mathematical model for the Green Vehicle Routing Problem (GVRP), incorporating bi-fuel (natural gas and gasoline) pickup trucks in a mixed vehicle fleet. The objective is to minimize overall costs relating to service (earliness and tardiness), transportation (fixed, variable and fuel), and carbon emissions. To reflect a real-world situation, the study considers: (1) a co...

متن کامل

بهینه یابی سبد سرویس در مسائل مسیریابی چند سطحی - چند محصولی و چند قرارگاهی وسایل نقلیه با هدف حداقل نمودن هزینه‌های توزیع

Optimizing the service card in multi-depot, multi-product and multi-level vehicle routing problem is one of the most important and at the same time, the most complex problems in the transportation problems contexts. Numerous exact heuristic and meta-heuristic algorithms have been developed for different vehicle routing problems. In this paper, a binary linear programming (BLP) based model for o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009